- mesh algorithm
- сетевой алгоритм (параллельных вычислений)
English-Russian dictionary of computer science and programming. 2013.
English-Russian dictionary of computer science and programming. 2013.
Mesh generation — is the practice of generating a polygonal or polyhedral mesh that approximates a geometric domain. The term grid generation is often used interchangeably. Typical uses are for rendering to a computer screen or for physical simulation such as… … Wikipedia
Mesh (disambiguation) — Mesh or MESH can refer to: Mesh, a type of material Mesh (scale), a measurement scale for small particles Mesh (band), a British synthpop band Mesh STL (now known as Modern Day Zero), a St. Louis rock band Mesh (mathematics), a concept in… … Wikipedia
MESH (cipher) — Infobox block cipher name = MESH designers = Nakahara, Rijmen, Preneel, Vandewalle publish date = 2002 derived from = IDEA key size = 128, 192, or 256 bits block size = 64, 96, or 128 bits structure = Substitution permutation network rounds = 8.5 … Wikipedia
Chew's second algorithm — Mesh of Lake Michigan using Chew s second algorithm implemented in the Triangle package. In mesh generation, Chew s second algorithm is a Delaunay refinement algorithm for creating quality constrained Delaunay triangulations … Wikipedia
Ruppert's algorithm — Input planar straight line graph Output conforming Delaunay triangulation … Wikipedia
Parallel mesh generation — in numerical analysis is a new research area between the boundaries of two scientific computing disciplines: computational geometry and parallel computingNikos Chrisochoides, Parallel Mesh Generation, Chapter in Numerical Solution of Partial… … Wikipedia
Wireless mesh network — Animation showing self healing wireless mesh (Click to enlarge) … Wikipedia
Optical mesh network — Transport network based on SONET/SDH ring architecture Optical mesh networks are a type of telecommunications network. Transport networks, the underlying optical fiber based layer of telecommunications networks, have evolved from DCS (Digital… … Wikipedia
Adaptive mesh refinement — This article is about the use of adaptive meshing in numerical analysis. See Subdivision surface for the use of adaptive techniques in Computer Graphics modelling. In numerical analysis, adaptive mesh refinement is a method of adaptive meshing.… … Wikipedia
Temporally-ordered routing algorithm — The Temporally Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad hoc networks. It was developed by Vincent Park at the University of Maryland and the Naval Research Laboratory. Park has… … Wikipedia
Minimum degree algorithm — In numerical analysis the minimum degree algorithm is an algorithm used to permute the rows and columns of a symmetric sparse matrix before applying the Cholesky decomposition, to reduce the number of non zeros in the Cholesky factor. This… … Wikipedia